Causal Rate Distortion Function on Abstract Alphabets and Optimal Reconstruction Kernel
نویسندگان
چکیده
A Causal rate distortion function with a general fidelity criterion is formulated on abstract alphabets and the optimal reconstruction kernel is derived, which consists of a product of causal kernels. In the process, general abstract spaces are introduced to show existence of the minimizing kernel using weak∗-convergence. Certain properties of the causal rate distortion function are presented.
منابع مشابه
Causal Rate Distortion Function on Abstract Alphabets: Optimal Reconstruction and Properties
A causal rate distortion function with a general fidelity criterion is formulated on abstract alphabets and a coding theorem is derived. Existence of the minimizing kernel is shown using the topology of weak convergence of probability measures. The optimal reconstruction kernel is derived, which is causal, and certain properties of the causal rate distortion function are presented.
متن کاملCausal Rate Distortion Function and Relations to Filtering Theory
A causal rate distortion function (RDF) is defined, existence of extremum solution is described via weak-convergence, and its relation to filtering theory is discussed. The relation to filtering is obtained via a causal constraint imposed on the reconstruction kernel to be realizable while the extremum solution is given for the stationary case.
متن کاملOptimal Nonstationary Reproduction Distribution for Nonanticipative RDF on Abstract Alphabets
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. In this paper we introduce a definition for nonanticipative Rate Distortion Function (RDF) on abstract alphabets, and we invoke weak convergence of probability measures to show various of its properties, such as, existence of the optimal reproduction conditional distribution, compactness of the fidelity set, lower semicontinuity of the RDF fun...
متن کاملRealizable Rate Distortion Function and Bayesian FIltering Theory
The relation between rate distortion function (RDF) and Bayesian filtering theory is discussed. The relation is established by imposing a causal or realizability constraint on the reconstruction conditional distribution of the RDF, leading to the definition of a causal RDF. Existence of the optimal reconstruction distribution of the causal RDF is shown using the topology of weak convergence of ...
متن کاملRate-Distortion Bounds for Kernel-Based Distortion Measures
Kernel methods have been used for turning linear learning algorithms into nonlinear ones. These nonlinear algorithms measure distances between data points by the distance in the kernel-induced feature space. In lossy data compression, the optimal tradeoff between the number of quantized points and the incurred distortion is characterized by the rate-distortion function. However, the rate-distor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1102.3294 شماره
صفحات -
تاریخ انتشار 2011